A hybrid evolutionary algorithm for the offline Bin Packing Problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Algorithm for Bin Packing Problem

In this paper we investigate the use of evolution strategy (ES) for the bin packing problem. We used (1, λ)-ES, where 10 children are generated from one parent by means of a simple genetic operators; the crossover is not applied. The best of the descendants becomes the new parent solution. A widely known ordering representation modified for the purposes of the grouping the objects was used in t...

متن کامل

A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem

The three-dimensional bin packing problem is a practical problem faced in modern industrial processes such as container ship loading, pallet loading, plane cargo management, and warehouse management. This article considers a three-dimensional bin packing problem in which objects of various volumes are packed into a single bin to maximize the number of objects packed. The bin packing problem ini...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

A Hybrid Improvement Heuristic for the Bin Packing Problem

Given a set of n items with weights wi, i = 1, . . . , n, the bin packing (BP) problem consists of finding the minimum number of bins of capacity C necessary to pack the items, without violating the capacity constraint. This formulation also entails another problem (DBP), in which we seek to minimize the capacity of a fixed number m of identical bins, so that all items fit in the m bins without...

متن کامل

A Hybrid Extremal Optimisation Approach for the Bin Packing Problem

Extremal optimisation (EO) is a simple and effective technique that is influenced by nature and which is especially suitable to solve assignment type problems. EO uses the principle of eliminating the weakest or the least adapted component and replacing it by a random one. This paper presents a new hybrid EO approach that consists of an EO framework with an improved local search for the bin pac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Central European Journal of Operations Research

سال: 2020

ISSN: 1435-246X,1613-9178

DOI: 10.1007/s10100-020-00695-5